منابع مشابه
On k-total edge product cordial graphs
A k-total edge product cordial labeling is a variant of the well-known cordial labeling. In this paper we characterize graphs admitting a 2total edge product cordial labeling. We also show that dense graphs and regular graphs of degree 2(k − 1) admit a k-total edge product cordial labeling.
متن کاملMost Graphs are Edge-Cordial
We extend the de nition of edge-cordial graphs due to Ng and Lee for graphs on 4k, 4k+1, and 4k+3 vertices to include graphs on 4k+2 vertices, and show that, in fact, all graphs without isolated vertices are edge-cordial. Ng and Lee conjectured that all trees on 4k, 4k + 1, or 4k + 3 vertices are edge-cordial. Intuitively speaking, a graph G is said to be edge-cordial if its edges can be labell...
متن کاملProduct Cordial Labeling for Some New Graphs
Received: December 16, 2010 Accepted: December 31, 2010 doi:10.5539/jmr.v3n2p206 Abstract In this paper we investigate product cordial labeling for some new graphs. We prove that the friendship graph, cycle with one chord (except when n is even and the chord joining the vertices at diameter distance), cycle with twin chords (except when n is even and one of the chord joining the vertices at dia...
متن کاملProduct of normal edge-transitive Cayley graphs
For two normal edge-transitive Cayley graphs on groups H and K which have no common direct factor and $gcd(|H/H^prime|,|Z(K)|)=1=gcd(|K/K^prime|,|Z(H)|)$, we consider four standard products of them and it is proved that only tensor product of factors can be normal edge-transitive.
متن کامل4-prime Cordial Graphs Obtained from 4-prime Cordial Graphs
Let G be a (p, q) graph. Let f : V (G) → {1, 2, . . . , k} be a function. For each edge uv, assign the label gcd (f(u), f(v)). f is called k-prime cordial labeling of G if ∣∣vf (i)− vf (j)∣∣ 6 1, i, j ∈ {1, 2, . . . , k} and ∣∣ef (0)− ef (1)∣∣ 6 1 where vf (x) denotes the number of vertices labeled with x, ef (1) and ef (0) respectively denote the number of edges labeled with 1 and not labeled ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Opuscula Mathematica
سال: 2019
ISSN: 1232-9274
DOI: 10.7494/opmath.2019.39.5.691